Combinatorial properties of double square tiles
نویسندگان
چکیده
We study the combinatorial properties and the problem of generating exhaustively double square tiles, i.e. polyominoes yielding two distinct periodic tilings by translated copies such that every polyomino in the tiling is surrounded by exactly four copies. We show in particular that every prime double square tile may be obtained from the unit square by applying successively some invertible operators on double squares. As a consequence, we prove a conjecture of Provençal and Vuillon [17] stating that these polyominoes are invariant under rotation by angle π.
منابع مشابه
Tilings, Compositions, and Generalizations
For n ≥ 1, let an count the number of ways one can tile a 1 × n chessboard using 1× 1 square tiles, which come in w colors, and 1× 2 rectangular tiles, which come in t colors. The results for an generalize the Fibonacci numbers and provide generalizations of many of the properties satisfied by the Fibonacci and Lucas numbers. We count the total number of 1× 1 square tiles and 1× 2 rectangular t...
متن کاملAperiodic Sets of Square Tiles with Colored Corners
In this paper we formalize the concept of square tiles with colored corners, a new kind of tiles closely related to Wang tiles. We construct aperiodic sets of square tiles with colored corners and several new aperiodic sets of Wang tiles using isomorphisms between tilings. The smallest aperiodic set of square tiles with colored corners we have created consists of 44 tiles over 6 colors.
متن کاملNon-Periodic Corner Tilings in Computer Graphics
Rendering computer-generated images is both memory and runtime intensive. This is particularly true in realtime computer graphics where large amounts of content have to be produced very quickly and from limited data. Tile-based methods offer a solution to this problem by generating large portions of a specific content out of a much smaller data set of tiles. This dissertation investigates the u...
متن کاملTiling with polyominoes and combinatorial group theory
When can a given finite region consisting of cells in a regular lattice (triangular, square, or hexagonal) in [w’ be perfectly tiled by tiles drawn from a finite set of tile shapes? This paper gives necessary conditions for the existence of such tilings using boundary inuariants, which are combinatorial group-theoretic invariants associated to the boundaries of the tile shapes and the regions t...
متن کاملProgramming random mazes.
Nature is full of algorithms melding deterministic and random processes. For example, pine trees grow following the same underlying genetic rules, yet no two in a forest are exactly the same. In the paper on page 251 we asked ourselves, could these stochastic algorithms provide simple programming rules to make complex structural patterns in a molecular system? Initially, we wanted to build dive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 502 شماره
صفحات -
تاریخ انتشار 2013